Systems of Nominal Classification in East Papuan Languages

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

‘Give’ Constructions in the Papuan Languages of Timor-Alor-Pantar

This paper describes three-participant 'give' constructions in ten Papuan languages of the Timor-Alor-Pantar (TAP) family. Generally lacking a class of simple ditransitive root verbs, TAP languages express 'give' events by means of biclausal constructions ('take X then give Y'), serial verb constructions ('take X give Y'), or particle-verb constructions originating in serial verb constructions....

متن کامل

Towards Nominal Formal Languages

We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.

متن کامل

Nominal Classification Gunter Senft

The problem of "classification" is a general problem of life. That classification abilities are necessary for the survival of every organism is an important insight of biology. Human beings classify consciously, unconsciously, and even subconsciously in all situations. When we confront a scientific problem, we try to solve it by first classifying the various parts of the problem. Therefore, the...

متن کامل

On Nominal Regular Languages with Binders

We investigate regular languages on infinite alphabets where words may contain binders on names. To this end, classical regular expressions and automata are extended with binders. We prove the equivalence between finite automata on binders and regular expressions with binders and investigate closure properties and complementation of regular languages with binders.

متن کامل

Towards Nominal Formal Languages (long version)

We introduce formal languages over infinite alphabets where words may contain binders. We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Oceanic Linguistics

سال: 2002

ISSN: 1527-9421

DOI: 10.1353/ol.2002.0029